Tangent-space methods for truncating uniform MPS

An essential primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one smaller bond dimension. This forms central bottleneck algorithms for time evolution and contracting projected entangled pair states. We formulate tangent-space based variational algorithm to achieve this goal uniform (infinite) The exhibits favourable scaling computational cost, we demonstrate its usefulness by several examples involving multiplication operator.